首页> 外文OA文献 >Wireless Network-Coded Bidirectional Relaying Using Latin Squares for M-PSK Modulation
【2h】

Wireless Network-Coded Bidirectional Relaying Using Latin Squares for M-PSK Modulation

机译:使用拉丁广场进行M-PSK调制的无线网络编码双向中继

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The design of modulation schemes for the physical layer network-coded two-way relaying scenario is considered with a protocol which employs two phases: multiple access (MA) phase and broadcast (BC) phase. It was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of MA interference which occurs at the relay during the MA phase and all these network coding maps should satisfy a requirement called the exclusive law. We show that every network coding map that satisfies the exclusive law is representable by a Latin Square and conversely, that this relationship can be used to get the network coding maps satisfying the exclusive law. The channel fade states for which the minimum distance of the effective constellation at the relay become zero are referred to as the singular fade states. For M - PSK modulation (M any power of 2), it is shown that there are (M-2/4 - M/2 + 1) M singular fade states. Also, it is shown that the constraints which the network coding maps should satisfy so that the harmful effects of the singular fade states are removed, can be viewed equivalently as partially filled Latin Squares (PFLS). The problem of finding all the required maps is reduced to finding a small set of maps for M - PSK constellations (any power of 2), obtained by the completion of PFLS. Even though the completability of M x M PFLS using M symbols is an open problem, specific cases where such a completion is always possible are identified and explicit construction procedures are provided. Having obtained the network coding maps, the set of all possible channel realizations (the complex plane) is quantized into a finite number of regions, with a specific network coding map chosen in a particular region. It is shown that the complex plane can be partitioned into two regions: a region in which any network coding map which satisfies the exclusive law gives the same best performance and a region in which the choice of the network coding map affects the performance. The quantization thus obtained analytically, leads to the same as the one obtained using computer search for M = 4-PSK signal set by Koike-Akino et al., when specialized for Simulation results show that the proposed scheme performs better than the conventional exclusive-OR (XOR) network coding and in some cases outperforms the scheme proposed by Koike-Akino et al.
机译:考虑采用采用两个阶段的协议来考虑物理层网络编码的双向中继场景的调制方案的设计:多路访问(MA)阶段和广播(BC)阶段。 Koike-Akino等人观察到了这一点。根据信道条件自适应地改变中继器使用的网络编码图,大大降低了在MA阶段中继器上发生的MA干扰的影响,所有这些网络编码图应满足称为排他法则的要求。我们证明,每个满足排他法则的网络编码图都可以用拉丁方表示,反之,这种关系可以用来获得满足排他法则的网络编码图。将中继处的有效星座图的最小距离变为零的信道衰落状态称为奇异衰落状态。对于M-PSK调制(M的2的任意幂),表明存在(M-2 / 4-M / 2 + 1)M个奇异的衰落状态。同样,可以看出,网络编码图应满足的约束条件才能消除奇异衰落状态的有害影响,可以等效地视为部分填充的拉丁方(PFLS)。找到所有所需图的问题被简化为找到一小套由PFLS完成而获得的M-PSK星座图(2的幂)。即使使用M个符号的M x M PFLS的可填充性是一个悬而未决的问题,也始终可以确定完成此类特定情况的具体情况,并提供了明确的施工程序。获得网络编码图后,所有可能的信道实现集(复平面)被量化为有限数量的区域,并在特定区域中选择特定的网络编码图。结果表明,复杂平面可以划分为两个区域:一个区域,其中满足排他法则的任何网络编码图都具有相同的最佳性能;一个区域,其中网络编码图的选择会影响性能。通过分析获得的量化结果与使用Koike-Akino等人针对M = 4-PSK信号设置的计算机搜索获得的量化结果相同,而专门用于仿真的结果表明,该方案的性能优于传统的排他性算法,或(XOR)网络编码在某些情况下优于Koike-Akino等人提出的方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号